Bounded and Well-Placed Theories in the Lattice of Equational Theories

نویسندگان

  • Jaroslav Ježek
  • George F. McNulty
  • Evelyn Nelson
چکیده

Among the earliest publications of Evelyn Nelson are four papers which appeared in 1971—Nelson [1971a, 1971b] and Burris and Nelson [1971/72, 1971]. These papers contributed to our understanding of the intricate structural diversity of the lattice of equational theories. In particular, these papers revealed that large partition lattices occur as intervals in the lattice of equational theories of semigroups. In the present paper, we focus on some contrasting features of the lattice of equational theories. We identify a filter in the lattice of equational theories, called the filter of bounded theories. This filter is countably infinite and fairly tractable, especially for similarity types which provide only one operation symbol. Every equational theory can be viewed as a fully invariant congruence relation on the term algebra of the appropriate similarity type. From this viewpoint, certain classes of equational theories emerge from the imposition of various cardinality restrictions on the equivalence classes of terms induced by these theories. At one extreme are the term-finite equational theories—those theories each of whose equivalence classes is finite. At another extreme, one should put those theories which induce only finitely many equivalence classes of terms. However, it is easy to see that, for each similarity type, there is only one such theory: the trivial theory based on x ≈ y. (Officially, we take equations to be ordered pairs of terms, but we frequently use the suggestive notation s ≈ t in place of the official 〈s, t〉.) A slightly more elaborate notion proves more suitable. Observe that for any equational theory T , the image of any T -equivalence class of terms with respect to any automorphism of the term algebra is again a T -equivalence class. So the automorphism group of the term algebra partitions the T -equivalence classes into orbits. We say that an equational theory T is bounded iff the automorphism group of the term algebra partitions the T -equivalence classes into finitely many orbits.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattices of Quasi-Equational Theories as Congruence Lattices of Semilattices with Operators: Part I

We show that for every quasivariety K of relational structures there is a semilattice S with operators such that the lattice of quasiequational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+, 0, F). As a consequence, new restrictions on the natural quasi-interior operator on lattices of quasi-equational theories are found. 1. Motivation and terminolo...

متن کامل

Equational Bases and Nonmodular Lattice Varieties ( ! )

This paper is focused on equational theories and equationally defined varieties of lattices which are not assumed to be modular. It contains both an elementary introduction to the subject and a survey of open problems and recent work. The concept of a "splitting" of the lattice of lattice theories is defined here for the first time in print. These splittings are shown to correspond bi-uniquely ...

متن کامل

Definability in the Lattice of Equational Theories of Commutative Semigroups

In this paper we study first-order definability in the lattice of equational theories of commutative semigroups. In a series of papers, J. Ježek, solving problems posed by A. Tarski and R. McKenzie, has proved, in particular, that each equational theory is first-order definable in the lattice of equational theories of a given type, up to automorphism, and that such lattices have no automorphism...

متن کامل

Definability for Equational Theories of Commutative Groupoids †

We find several large classes of equations with the property that every automorphism of the lattice of equational theories of commutative groupoids fixes any equational theory generated by such equations, and every equational theory generated by finitely many such equations is a definable element of the lattice. We conjecture that the lattice has no non-identical automorphisms.

متن کامل

The Existence of Finitely Based Lower Covers for Finitely Based Equational Theories

By an equational theory we mean a set of equations from some fixed language which is closed with respect to logical consequences. We regard equations as universal sentences whose quantifierfree parts are equations between terms. In our notation, we suppress the universal quantifiers. Once a language has been fixed, the collection of all equational theories for that language is a lattice ordered...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011